Linear Recurrences and Chebyshev Polynomials
نویسندگان
چکیده
with given a, b, t0, t1 and n ≥ 0. This sequence was introduced by Horadam [3] in 1965, and it generalizes many sequences (see [1, 4]). Examples of such sequences are Fibonacci polynomials sequence (Fn(x))n≥0, Lucas polynomials sequence (Ln(x))n≥0, and Pell polynomials sequence (Pn(x))n≥0, when one has a = x, b = t1 = 1, t0 = 0; a = t1 = x, b = 1, t0 = 2; and a = 2x, b = t1 = 1, t0 = 0; respectively. Chebyshev polynomials of the second kind (in this paper just Chebyshev polynomials) are defined by
منابع مشابه
Factorizations and representations of the backward second-order linear recurrences
We show the relationships between the determinants and permanents of certain tridiagonal matrices and the negatively subscripted terms of second-order linear recurrences.Also considering how to the negatively subscripted terms of second-order linear recurrences can be connected to Chebyshev polynomials by determinants of these matrices, we give factorizations and representations of these number...
متن کاملFactorizations and Representations of Second Order Linear Recurrences with Indices in Arithmetic Progressions
In this paper we consider second order recurrences {Vk} and {Un} . We give second order linear recurrences for the sequences {V±kn} and {U±kn}. Using these recurrence relations, we derive relationships between the determinants of certain matrices and these sequences. Further, as generalizations of the earlier results, we give representations and trigonometric factorizations of these sequences b...
متن کاملA fractional type of the Chebyshev polynomials for approximation of solution of linear fractional differential equations
In this paper we introduce a type of fractional-order polynomials based on the classical Chebyshev polynomials of the second kind (FCSs). Also we construct the operational matrix of fractional derivative of order $ gamma $ in the Caputo for FCSs and show that this matrix with the Tau method are utilized to reduce the solution of some fractional-order differential equations.
متن کاملA numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کاملThe Chebyshev iteration revisited
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massively parallel computers with high communication cost. Here, six different algorithms that implement this method are presented and compared with respect to roundoff effects, in particular, the ultimately achievable accur...
متن کامل